Robust linear programming discrimination of two linearly inseparable sets
نویسندگان
چکیده
منابع مشابه
To appear in Optimization Methods and Software ROBUST LINEAR PROGRAMMING DISCRIMINATION OF TWO LINEARLY INSEPARABLE SETS
A single linear programming formulation is proposed which generates a plane that minimizes an average sum of misclassi ed points belonging to two disjoint points sets in n-dimensional real space. When the convex hulls of the two sets are also disjoint, the plane completely separates the two sets. When the convex hulls intersect, our linear program, unlike all previously proposed linear programs...
متن کاملRobust Dynamic Programming for Linearly Constrained Polytopic Systems with Piecewise Linear Cost
We present a new method for robust dynamic programming that is suitable for linearly constrained polytopic systems with piecewise linear cost functions. The method avoids Bellman’s “curse of dimensionality” and performs exact dynamic programming without any discretization of the state space by using polyhedral representations of the cost-to-go functions and feasible sets. It is shown that the r...
متن کاملLinear discrimination using second order conic programming
We propose a new p-norm linear discrimination model that generalizes the model of Bennett and Mangasarian (1992) and reduces to linear programming problem with p-order conic constraints. We demonstrate that the developed model possesses excellent methodological and computational properties (e.g., it does not allow for a null separating hyperplane when the sets are linearly separable, etc). The ...
متن کاملA Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets
In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms. Bounds on the difference between the number of comparisons required by this algorithm and the information theory lower bounds are derived. Results from a computer implementation of the new algorithm are gi...
متن کاملConstructing Uncertainty Sets for Robust Linear Optimization
In this paper, we propose a methodology for constructing uncertainty sets within the framework of robust optimization for linear optimization problems with uncertain parameters. Our approach relies on decision-maker risk preferences. Specifically, we utilize the theory of coherent risk measures initiated by Artzner et al. [3], and show that such risk measures, in conjunction with the support of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 1992
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556789208805504